Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams

نویسندگان

  • Franco Raimondi
  • Alessio Lomuscio
چکیده

We present a methodology for the verification of multi-agent systems, whose properties are specified by means of a modal logic that includes a temporal, an epistemic, and a modal operator to reason about correct behaviour of agents. The verification technique relies on model checking via ordered binary decision diagrams. We present an implementation and report on experimental results for two scenarios: the bit transmission problem with faults and the protocol of the dining cryptographers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Multi-Agent Systems via SDD-based Model Checking

Considerable progress has been achieved in the past ten years in the symbolic verification of Multi-Agent Systems (MAS). One of the most efficient techniques put forward is based on the use of ordered binary decision diagrams (OBDDs) for representing the state space and computing the states at which specifications hold. Sentential Decision Diagrams (SDDs) have recently been put forward as an al...

متن کامل

Bounded Model Checking Linear Time and Knowledge Using Decision Diagrams

We present a novel approach to verification of multi-agent systems by bounded model checking for LTLK, i.e., Linear Time Temporal Logic extended with the epistemic component, which is interpreted over interleaved interpreted systems. Our method is based on binary decision diagrams. We describe the algorithm and provide its experimental evaluation together with the comparison with an existing tool.

متن کامل

Symbolic Model Checking for Multi-Agent Systems

Multi-Agent Systems are increasingly complex, and the problem of their verification and validation is acquiring increasing importance. In this paper we show how a well known and effective verification technique, symbolic model checking, can be generalized to deal with Multi-Agent Systems. Our approach is fully amenable to the reuse of data structures used in symbolic model checking, Binary Deci...

متن کامل

Automatic Verification of Deontic Properties of Multi-agent Systems

We present an algorithm and its implementation for the verification of correct behaviour and epistemic states in multiagent systems. The verification is performed via model checking techniques based on OBDD’s. We test our implementation by means of a communication example: the bit transmission problem with faults.

متن کامل

AMethod of BoundedModel Checking for aTemporal Epistemic Logic Based onReducedOrdered Binary DecisionDiagrams

Symbolic model checking is a powerful technique for the verification of reactive systems. Traditionally, such approaches use reduced ordered binary decision diagrams (ROBDDs) to represent the model. ese, however, suffer adversely from the infamous state space explosion problem. Bounded model checking – a procedure for “bug hunting” – attempts to alleviate this difficulty by considering only a t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Logic

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2007